package Test;

import java.util.HashMap;
import java.util.concurrent.ConcurrentHashMap;

public class Test8 {
    public static void main1(String[] args) {
        ConcurrentHashMap<String,Integer> map = new ConcurrentHashMap<>();
        map.put("666",1);
        HashMap<String,String> hashMap = new HashMap();
    }

    public static void main(String[] args) {
        int count = 0;
        for (int i = 1; i <=10000000 ; i++) {
            if((i % 15) == 3){
                count++;
            }
        }
        System.out.println(count);
    }

    public static void main4(String[] args) {
        int n = 256;//1100
        System.out.println((n |= n >>> 1));//1100 | 0110//保证是偶数
        n |= n >>> 2;//1110 | 0011 1111 //
        n |= n >>> 4;//1111 | 0000 1111
        n |= n >>> 8;
        n |= n >>> 16;
        System.out.println(n);
    }
    //根据找到为1的最高为,后序的所有0啊1啊统一变成1
    //其余的值不用管,只需要注意为1的最高位就好,经过上述运算结果就是为1的最高位后面的所有位(包括最高位)都是1,
    public static void main2(String[] args) {
        int count = 0;
        if(count == 0){
            count = 10;
        }else if(count == 10){
            count = 20;
        }else {

        }
        System.out.println(count);
        System.out.println(1.0*5/2);
        System.out.printf("%x",1<<30);
    }
}
